3,037 research outputs found

    Electromagnetic coupling simulagions for a magnetic induction sensor for sleep monitoring

    Get PDF
    Magnetic induction (MI) method has been extensively used in non-destructive testing of materials. In biomedical applications, it attracted lots of attention for the contact-less advantages it provides. Sleep monitoring through detecting conductivity changes in lungs and heart during breathing and cardiac activity is the purpose of our studies. The low conductivity of biological tissues increase the complexity of the design of such systems. One challenge is to separate the effects of magnetic field from the electric field; achieving a pure magnetic contribution is difficult since the received signal is contaminated by the unwanted capacitive coupling. Our hypothesis is that for a periodic vital sign monitoring like breathing and heart activity, part of this secondary coupling could be considered as a desired effect to take the advantage of both contributions. In this paper, the coupling mechanisms existed in our system have been simulated and studied using finite element and Orcad simulations to estimate different contributions we would have in the developed MI system.Peer ReviewedPostprint (author’s final draft

    Elementary Landscape Decomposition of the Test Suite Minimization Problem

    Get PDF
    Chicano, F., Ferrer J., & Alba E. (2011). Elementary Landscape Decomposition of the Test Suite Minimization Problem. In Proceedings of Search Based Software Engineering, Szeged, Hungary, September 10-12, 2011. pp. 48–63.Landscape theory provides a formal framework in which combinatorial optimization problems can be theoretically characterized as a sum of a special kind of landscape called elementary landscape. The decomposition of the objective function of a problem into its elementary components provides additional knowledge on the problem that can be exploited to create new search methods for the problem. We analyze the Test Suite Minimization problem in Regression Testing from the point of view of landscape theory. We find the elementary landscape decomposition of the problem and propose a practical application of such decomposition for the search.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech. This research has been partially funded by the Spanish Ministry of Science and Innovation and FEDER under contract TIN2008-06491- C04-01 (the M∗ project) and the Andalusian Government under contract P07- TIC-03044 (DIRICOM project)

    Measuring the Quality of Machine Learning and Optimization Frameworks

    Get PDF
    Software frameworks are daily and extensively used in research, both for fundamental studies and applications. Researchers usually trust in the quality of these frameworks without any evidence that they are correctly build, indeed they could contain some defects that potentially could affect to thousands of already published and future papers. Considering the important role of these frameworks in the current state-of-the-art in research, their quality should be quantified to show the weaknesses and strengths of each software package. In this paper we study the main static quality properties, defined in the product quality model proposed by the ISO 25010 standard, of ten well-known frameworks. We provide a quality rating for each characteristic depending on the severity of the issues detected in the analysis. In addition, we propose an overall quality rating of 12 levels (ranging from A+ to D-) considering the ratings of all characteristics. As a result, we have data evidence to claim that the analysed frameworks are not in a good shape, because the best overall rating is just a C+ for Mahout framework, i.e., all packages need to go for a revision in the analysed features. Focusing on the characteristics individually, maintainability is by far the one which needs the biggest effort to fix the found defects. On the other hand, performance obtains the best average rating, a result which conforms to our expectations because frameworks’ authors used to take care about how fast their software runs.University of Malaga. Campus de Excelencia Internacional Andalucía Tech. We would like to say thank you to all authors of these frameworks that make research easier for all of us. This research has been partially funded by CELTIC C2017/2-2 in collaboration with companies EMERGYA and SECMOTIC with contracts #8.06/5.47.4997 and #8.06/5.47.4996. It has also been funded by the Spanish Ministry of Science and Innovation and /Junta de Andalucı́a/FEDER under contracts TIN2014-57341-R and TIN2017-88213-R, the network of smart cities CI-RTI (TIN2016-81766-REDT

    Cine: El arco iris de la memoria

    Get PDF
    Sin resume

    Modelling probabilistic cache representativeness in the presence of arbitrary access patterns

    Get PDF
    Measurement-Based Probabilistic Timing Analysis (MBPTA) is a promising powerful industry-friendly method to derive worst-case execution time (WCET) estimates as needed for critical real-time embedded systems. MBPTA performs several (R) runs of the program on the target platform collecting the execution times in each run. MBPTA builds a probabilistic representativeness argument on whether those events with high impact on execution time, such as cache misses, arise on the runs made at analysis time so that their impact on execution time is captured. So far only events occurring in cache memories have been shown to challenge providing such representativeness argument. In this context, this paper introduces a representativeness validation method (RVS) to assess the probabilistic representativeness of MBPTA’s execution time observations in terms of cache behaviour. RVS resorts to cache simulation to predict worst-case miss scenarios that can appear during the deployment phase. RVS also constructs a probabilistic Worst-Case Miss Count curve based on the miss-counts captured in the R runs. If that curve upperbounds the impact of the predicted cache worst-case scenarios, R is deemed as a sufficient number of runs for which pWCET estimates can be reliably derived. Otherwise, the user is requested to perform more runs until all cache scenarios of interest are captured.Peer ReviewedPostprint (author's final draft

    Improving early design stage timing modeling in multicore based real-time systems

    Get PDF
    This paper presents a modelling approach for the timing behavior of real-time embedded systems (RTES) in early design phases. The model focuses on multicore processors - accepted as the next computing platform for RTES - and in particular it predicts the contention tasks suffer in the access to multicore on-chip shared resources. The model presents the key properties of not requiring the application's source code or binary and having high-accuracy and low overhead. The former is of paramount importance in those common scenarios in which several software suppliers work in parallel implementing different applications for a system integrator, subject to different intellectual property (IP) constraints. Our model helps reducing the risk of exceeding the assigned budgets for each application in late design stages and its associated costs.This work has received funding from the European Space Agency under Project Reference AO=17722=13=NL=LvH, and has also been supported by the Spanish Ministry of Science and Innovation grant TIN2015-65316-P. Jaume Abella has been partially supported by the MINECO under Ramon y Cajal postdoctoral fellowship number RYC-2013-14717.Peer ReviewedPostprint (author's final draft

    Validating a timing simulator for the NGMP multicore processor

    Get PDF
    Timing simulation is a key element in multicore systems design. It enables a fast and cost effective design space exploration, allowing to simulate new architectural improvements without requiring RTL abstraction levels. Timing simulation also allows software developers to perform early testing of the timing behavior of their software without the need of buying the actual physical board, which can be very expensive when the board uses non-COTS technology. In this paper we present the validation of a timing simulator for the NGMP multicore processor, which is a 4 core processor being developed to become the reference platform for future missions of the European Space Agency.The research leading to these results has received funding from the European Space Agency under contract NPI 4000102880 and the Ministry of Science and Technology of Spain under contract TIN-2015-65316-P. Jaume Abella has been partially supported by the Ministry of Economy and Competitiveness under Ramon y Cajal postdoctoral fellowship number RYC-2013-14717.Peer ReviewedPostprint (author's final draft

    Movements of juvenile Bonelli's eagles aquila Fasciata during dispersal

    Get PDF
    Capsule Juvenile non-breeding males and females explored surrounding areas, returned to breeding areas, and settled in temporary settlement areas. Aims To describe movement patterns of juvenile Bonelli's Eagles during the transient phase of dispersal. Methods Radiotelemetry data from 16 individuals were studied. Results Six main temporary settlement areas were located. No sex differences were found in the time to first departure from natal areas, time to the first temporary settlement, or time of the first return to natal areas. Juvenile eagles did not settle in temporary settlement areas until they were, on average, 245 days old. In general, males and females did not differ in their movement patterns during the early part of the dispersal period. However, after approximately 500 days males spent 60.8% of their time exploring surrounding areas, probably with the aim of searching for vacant territories or mates, whereas females of the same age devoted 26.7% of their time to exploration. Conclusion Movements and use of sites during the transient phase of dispersal are complex. They have important implications for the conservation of this endangered species. © 2009 British Trust for Ornithology.Peer Reviewe
    corecore